A Computable Measure of Algorithmic Probability by Finite Approximations with an Application to Integer Sequences

A Computable Measure of Algorithmic Probability by Finite Approximations

We study formal properties of a Levin-inspired measure m calculated from the output distribution of small Turing machines. We introduce and justify finite approximations mk that have already been used in applications as an alternative to lossless compression algorithms for approximating algorithmic (Kolmogorov-Chaitin) complexity. We provide proofs of the relevant properties of both m and mk an...

‏‎a comparative study of language learning strategies employmed by bilinguals and monolinguals with reference to attitudes and motivation‎‏

هدف از این تحقیق بررسی برخی عوامل ادراکی واحساسی یعنی استفاده از شیوه های یادگیری زبان ، انگیزه ها ونگرش نسبت به زبان انگلیسی در رابطه با زمینه زبانی زبان آموزان می باشد. هدف بررسی این نکته بود که آیا اختلافی چشمگیر میان زبان آموزان دو زبانه و تک زبانه در میزان استفاده از شیوه های یادگیری زبان ، انگیزه ها نگرش و سطح مهارت زبانی وجود دارد. همچنین سعی شد تا بهترین و موثرترین عوامل پیش بینی کننده ...

An Operational Characterization of the Notion of Probability by Algorithmic Randomness and Its Application to Cryptography

The notion of probability plays an important role in almost all areas of science, including cryptography. In modern mathematics, however, probability theory means nothing other than measure theory, and the operational characterization of the notion of probability is not established yet. In this paper, based on the toolkit of algorithmic randomness we present an operational characterization of t...

On Reducing sequences and an Application to Local Cohomology Modules

Finite Inductive Sequences, Kolmogorov Complexity with Application to Genome Sequences

We describe current work in examining the complexity of genomic sequences at the amino acid level. We have provided an original algorithm description and research results when considering this algorithm as a measure of Kolmogorov complexity of such candidate strings. The results can be used to estimate comparative string values, identifying substrings with comparable values, and determining reg...